Universal triple encoding for compression and protecting binary data
نویسندگان
چکیده
منابع مشابه
Universal Lossless Data Compression Via Binary Decision Diagrams
A binary string of length 2 induces the Boolean function of k variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The given binary string is fully recoverable from this ROBDD. We exhibit a lossless data compression algorithm in which a binary string of length a power of two is com...
متن کاملUniversal Triple I Method for Fuzzy Reasoning and Fuzzy Controller
As a generalization of the triple I method, the universal triple Imethod is investigated from the viewpoints of both fuzzy reasoningand fuzzy controller. The universal triple I principle is putforward, which improves the previous triple I principle. Then,unified form of universal triple I method is established based onthe (0,1)-implication or R-implication. Moreover, the reversibilityproperty o...
متن کاملA universal algorithm for sequential data compression
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified...
متن کاملRobustly Minimax Codes for Universal Data Compression
We introduce a notion of ‘relative redundancy’ for universal data compression and propose a universal code which asymptotically achieves the minimax value of the relative redundancy. The relative redundancy is a hybrid of redundancy and coding regret (pointwise redundancy), where a class of information sources and a class of codes are assumed. The minimax code for relative redundancy is an exte...
متن کاملUniversal lossless data compression algorithms
4 Improved compression algorithm based on the Burrows–Wheeler transform 61 4.1 Modifications of the basic version of the compression algorithm. 61 5 Conclusions 141 iii Acknowledgements 145 Bibliography 147 Appendices 161 A Silesia corpus 163 B Implementation details 167 C Detailed options of examined compression programs 173 D Illustration of the properties of the weight functions 177 E Detail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bezopasnost informacionnyh tehnology
سال: 2021
ISSN: 2074-7136,2074-7128
DOI: 10.26583/bit.2021.1.01